ON THE ACYCLIC POINT-CONNECTIVITY OF THE n-CUBE
نویسنده
چکیده
The acyclic point-connectivity of a graph G, denoted (G), is the minimum number of points whose removal from G results in an acyclic graph. In a 1975 paper, Harary stated erroneously that (Qn 2 n-I i where Qn denotes the n-cube. We prove that for n > 4, 7 2 n-4 -< () -< 2 n-I 2n-y-2, where y [log2(ni)]. We show that the upper bound is obtained for n -< 8 and conjecture that it is obtained for all n.
منابع مشابه
Study on follicular characteristics, hormonal and biochemical profile in norgestomet+PMSG treated acyclic buffaloes
This research was conducted to study the follicular dynamics, hormonal, biochemical profile and fertility response in acyclic and norgestomet+PMSG treated acyclic buffaloes in summer. The study animals were divided into two groups: group I [control (n=8): no treatment] and II [treatment group (n=15)]. In group II, seven animals were used for follicular biochemical and hormonal profile and eight...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملOn the Szeged and Eccentric connectivity indices of non-commutative graph of finite groups
Let $G$ be a non-abelian group. The non-commuting graph $Gamma_G$ of $G$ is defined as the graph whose vertex set is the non-central elements of $G$ and two vertices are joined if and only if they do not commute.In this paper we study some properties of $Gamma_G$ and introduce $n$-regular $AC$-groups. Also we then obtain a formula for Szeged index of $Gamma_G$ in terms of $n$, $|Z(G)|$ and $|G|...
متن کاملThe Number of Small Covers over Cubes
In the present paper we find a bijection between the set of small covers over an n-cube and the set of acyclic digraphs with n labeled nodes. Using this, we give a formula of the number of small covers over an n-cube (generally, a product of simplices) up to Davis-Januszkiewicz equivalence classes and Zn2 -equivariant diffeomorphism classes. Moreover we prove that the number of acyclic digraphs...
متن کاملRecognizing Graphs of Acyclic Cubical Complexes
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination schemes and showed that the graphs of acyclic cubical complexes are retracts of cubes characterized by certain forbidden convex subgraphs. In this paper we present an algorithm of time complexity O(m log n) which recog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004